A Functional Framework for Result Checking
نویسندگان
چکیده
Result checking is a general methodology for ensuring that untrusted computations are valid. Its essence lies in defining efficient checking procedures to verify that a result satisfies some expected property. Result checking often relies on certificates to make the verification process efficient, and thus involves two strongly connected tasks: the generation of certificates and the implementation of a checking procedure. Several ad-hoc solutions exist, but they differ significantly on the kind of properties involved and thus on the validation procedure. The lack of common methodologies has been an obstacle to the applicability of result checking to a more comprehensive set of algorithms. We propose the first framework for building result checking infrastructures for a large class of properties, and illustrate its generality through several examples. The framework has been implemented in Haskell.
منابع مشابه
Proof Checking Technology for Satisfiability Modulo Theories
A common proof format for solvers for Satisfiability Modulo Theories (SMT) is proposed, based on the Edinburgh Logical Framework (LF). Two problems arise: checking very large proofs, and keeping proofs compact in the presence of complex side conditions on rules. Incremental checking combines parsing and proof checking in a single step, to avoid building in-memory representations of proof subter...
متن کاملA Temporal Logic with Event Clock Automata for Timed Hybrid Petri Nets
The Hybrid Functional Petri Nets (HFPN) formalism has already shown its convenience for modelling biological systems. This class of models have been fruitfully applied in biology but the remarkable expressiveness of HFPN often leads to incomplete formal validations. In this paper, we propose a formal logical framework for Timed Hybrid Petri Nets (THPN), a sub-class of HFPN. We propose an extens...
متن کاملVerification of biological models with Timed Hybrid Petri nets
The Hybrid Functional Petri Nets (HFPN) formalism has already shown its convenience for modelling biological systems. This class of models have been fruitfully applied in biology but the remarkable expressiveness of HFPN often leads to incomplete formal validations. In this paper, we propose a formal logical framework for Timed Hybrid Petri Nets (THPN), a sub-class of HFPN. We propose an extens...
متن کاملVerification of biological models with Temporal Logic and Timed Hybrid Petri Nets
The Hybrid Functional Petri Nets (HFPN) formalism has already shown its convenience for modelling biological systems. This class of models have been fruitfully applied in biology but the remarkable expressiveness of HFPN often leads to incomplete formal validations. In this paper, we propose a formal logical framework for Timed Hybrid Petri Nets (THPN), a sub-class of HFPN. We propose an extens...
متن کاملFAuST: A Framework for Formal Verification, Automated Debugging, and Software Test Generation
We present FAuST, an extensible framework for Formal verification, Automated debugging, and Software Test generation. Our framework uses a highly customizeable Bounded Model Checking (BMC) algorithm for formal reasoning about software programs and provides different applications, e.g., property checking, functional equivalence checking, test case generation, and fault localization. FAuST suppor...
متن کامل